A Globally Convergent Filter–trust-region Method for Large Deformation Contact Problems

نویسنده

  • JONATHAN YOUETT
چکیده

We present a globally convergent method for the solution of frictionless large deformation contact problems involving hyperelastic materials. For the discretisation we apply the dual mortar method which is known to be more stable than node-to-segment approaches. The resulting non-convex constrained minimisation problems are solved using a filter–trust-region scheme. This method combines several techniques from non-linear optimisation to achieve global convergence towards first-order optimal points. To speed up the method inexact linearisations of the non-penetration constraint are used whenever the current iterate is far away from a critical point. A monotone multigrid method is applied for the fast solution of the constrained Newton problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Globally Convergent Filter-Type Trust Region Method for Semidefinite Programming

When using interior methods for solving semidefinite programming SDP , one needs to solve a system of linear equations at each iteration. For problems of large size, solving the system of linear equations can be very expensive. In this paper, based on a semismooth equation reformulation using Fischer’s function, we propose a filter method with trust region for solving large-scale SDP problems. ...

متن کامل

A filter-trust-region method for simple-bound constrained optimization

In this paper we propose a filter-trust-region algorithm for solving nonlinear optimization problems with simple bounds. It extends the technique of Gould, Sainvitu and Toint [15] designed for unconstrained optimization. The two main ingredients of the method are a filter-trust-region algorithm and the use of a gradient-projection method. The algorithm is shown to be globally convergent to at l...

متن کامل

Solving Generalized Semi-Infinite Programming Problems with a Trust Region Method

In this paper, a trust region method for generalized semi-infinite programming problems is presented. The method is based on [O. Yi-gui, “A filter trust region method for solving semi-infinite programming problems”, J. Appl. Math. Comput. 29, 311 (2009)]. We transformed the method from standard to generalized semi-infinite programming problems. The semismooth reformulation of the Karush–Kuhn–Tu...

متن کامل

A Filter-Trust-Region Method for Unconstrained Optimization

A new filter-trust-region algorithm for solving unconstrained nonlinear optimization problems is introduced. Based on the filter technique introduced by Fletcher and Leyffer, it extends an existing technique of Gould, Leyffer, and Toint [SIAM J. Optim., 15 (2004), pp. 17–38] for nonlinear equations and nonlinear least-squares to the fully general unconstrained optimization problem. The new algo...

متن کامل

Global convergence of a nonmonotone filter method for equality constrained optimization

A new nonmonotone filter trust region method is introduced for solving optimization problems with equality constraints. This method directly uses the dominated area of the filter as an acceptability criterion for trial points and allows the dominated area decreasing nonmonotonically. Compared with the filter-type method, our method has more flexible criteria and can avoidMaratos effect in a cer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016